Reliable Task Allocation inDistributed Mobile Computing System with random node movement: Replication and Load Sharing Approach

This research solves the problem of maximizing reliability of heterogeneous distributed computing system where random node can fail permanently. The reliability of the system can be achieved by executing all the tasks queued on its node before they all fail. As the mobile network is defined as a dense collection of mobile entities connected by a wireless link, without any administration or fixed support. In the mobile network no central authority is present due to which the network disconnection is very frequent between the mobile nodes[1]. A chance of errors in the mobile distributed network is very high. Although battery capacities keep increasing, the execution demands of modern mobile devices continue to outstrip their battery lives. As a result, battery life is bound to remain a key factor in the design of mobile applications. In this paper we focused to improve the fault tolerance of the mobile distributed system so that it will take less time and energy consumption for execution when a node fails as compared to other